PSL Assertion Checking with Temporally Extended High-Level Decision Diagrams

نویسندگان

  • Maksim Jenihhin
  • Jaan Raik
  • Anton Chepurov
  • Raimund Ubar
چکیده

The paper proposes a novel method for PSL language assertions conversion to a system representation model called High-Level Decision Diagrams (HLDD). Previous works have shown that HLDDs are an efficient model for simulation and convenient for diagnosis and debug. We present a technique, where checking of PSL assertions is integrated into fast HLDDbased simulation. There are three main contributions in the paper. The first one is a methodology for direct conversion of PSL properties to HLDD. The second one is a temporal extension for the existing HLDD model. The third one is HLDD-based simulator modification to support the new type of HLDDs and assertions checking. Index Terms dynamic verification, assertions, property specification language (PSL), high-level decision diagrams

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSL Assertion Checking Using Temporally Extended High-Level Decision Diagrams

The paper proposes a novel method for PSL language assertions simulationbased checking. The method uses a system representation model called High-Level Decision Diagrams (HLDD). Previous works have shown that HLDDs are an efficient model for simulation and convenient for diagnosis and debug. The presented approach proposes a temporal extension for the existing HLDD model aimed at supporting tem...

متن کامل

Assertion Checking with PSL and High-Level Decision Diagrams

The paper proposes a novel method for checking PSL language assertions using a system representation called HighLevel Decision Diagrams (HLDD). Previous works have shown that HLDDs are an efficient model for simulation and test pattern generation. We present a technique, where checking of PSL assertions is integrated into fast HLDD-based simulation. Current approach applies assertion checker ge...

متن کامل

MBP: a Model Based Planner

The Model Based Planner (MBP) is a system for planning in non-deterministic domains. It can generate plans automatically to solve various planning problems, like conformant planning, planning under partial observability, and planning for temporally extended goals. Moreover, MBP can validate plans, and offers a variety of simulation functionalities for plans and domains. MBP is based on Symbolic...

متن کامل

Word Level Symbolic Model Checking A New Approach for Verifying Arithmetic Circuits

The highly-publicized division error in the Pentium has emphasized the importance of formal verification of arithmetic operations. Symbolic model checking techniques based on binary decision diagrams (BDDs) have been successful in verifying control logic. However, lack of proper representation for functions that map boolean vectors into integers has prevented this technique from being used for ...

متن کامل

Towards Distributed Software Model-Checking Using Decision Diagrams

Symbolic data structures such as Decision Diagrams have proved successful for model-checking. For high-level specifications such as those used in programming languages, especially when manipulating pointers or arrays, building and evaluating the transition is a challenging problem that limits wider applicability of symbolic methods. We propose a new symbolic algorithm, EquivSplit, allowing an e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008